Operators that Attain Reduced Minimum
نویسندگان
چکیده
منابع مشابه
Minimal Surfaces That Attain Equality in the Chern-osserman Inequality
In the previous paper, Takahasi and the authors generalized the theory of minimal surfaces in Euclidean n-space to that of surfaces with holomorphic Gauss map in certain class of non-compact symmetric spaces. It also includes the theory of constant mean curvature one surfaces in hyperbolic 3-space. Moreover, a Chern-Osserman type inequality for such surfaces was shown. Though its equality condi...
متن کاملA Simple Proof that Time-Invariant Convolutional Codes Attain Capacity
It is well known that time-varying convolutional codes can achieve the capacity of a discrete memoryless channel [1]. The time varying assumption is needed in the proof to assure pairwise independency between the codewords. In this work we provide a relatively simple proof that indeed time-invariant convolutional codes can achieve the capacity without any restriction (albeit, the error exponent...
متن کاملEla on Bipartite Graphs Which Attain Minimum Rank among Bipartite Graphs with a given Diameter
The rank of a graph is defined to be the rank of its adjacency matrix. In this paper, the bipartite graphs that attain the minimum rank among bipartite graphs with a given diameter are completely characterized.
متن کاملOn bipartite graphs which attain minimum rank among bipartite graphs with given diameter
The rank of a graph is defined to be the rank of its adjacency matrix. In this paper, the bipartite graphs that attain the minimum rank among bipartite graphs with a given diameter are completely characterized.
متن کاملReduced Aggregate Scattering Operators for Path Tracing
Aggregate scattering operators (ASOs) describe the overall scattering behavior of an asset (i.e., an object or volume, or collection thereof) accounting for all orders of its internal scattering. We propose a practical way to precompute and compactly store ASOs and demonstrate their ability to accelerate path tracing. Our approach is modular avoiding costly and inflexible scene-dependent precom...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indian Journal of Pure and Applied Mathematics
سال: 2020
ISSN: 0019-5588,0975-7465
DOI: 10.1007/s13226-020-0485-6